Adaptive blind channel estimation by least squares smoothing

نویسندگان

  • Qing Zhao
  • Lang Tong
چکیده

A least squares smoothing (LSS) approach is presented for the blind estimation of single-input multiple-output (SIMO) finite impulse response systems. By exploiting the isomorphic relation between the input and output subspaces, this geometrical approach identifies the channel from a specially formed least squares smoothing error of the channel output. LSS has the finite sample convergence property, i.e., in the absence of noise, the channel is estimated perfectly with only a finite number of data samples. Referred to as the adaptive least squares smoothing (A-LSS) algorithm, the adaptive implementation has a high convergence rate and low computation cost with no matrix operations. A-LSS is order recursive and is implemented in part using a lattice filter. It has the advantage that when the channel order varies, channel estimates can be obtained without structural change of the implementation. For uncorrelated input sequence, the proposed algorithm performs direct deconvolution as a by-product.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decision feedback blind symbol estimation by adaptive least squares smoothing

A decision feedback blind symbol estimation algorithm based on the least squares smoothing approach is proposed for single-input multiple-output finite impulse response systems. With the finite alphabet property, the input signal is estimated based on the past detected symbols and the least squares smoothing error of the observation. Implemented both time and order recursively, the proposed alg...

متن کامل

Joint order detection and blind channel estimation by least squares smoothing

A joint order detection and blind estimation algorithm for single input multiple output channels is proposed. By exploiting the isomorphic relation between the channel input and output subspaces, it is shown that the channel order and channel impulse response are uniquely determined by finite least squares smoothing error sequence in the absence of noise. The proposed subspace algorithm is show...

متن کامل

An Adaptive Blind Receiver for Asynchronous Ds-cdma Based on Recursive Svd and Rls

| In this paper we present an adaptive blind receiver for asynchronous direct sequence code division multiple access (DS-CDMA) communication over multipath channels. The algorithm can handle both multiuser interference (MUI) and intersymbol interference (ISI) by the use of a twofold spreading together with some spatial over-sampling. It is based on a blind virtual channel identiication using th...

متن کامل

A modified QRD for smoothing and a QRD-LSL smoothing algorithm

term in (A.12) be negligible compared with (35), we must further require that (T =B 2)e 0 =B approaches zero. This rather unusual requirement simply assures that the modeling errors (bias squared) be negligible compared with the error variance. The derivation of the bound in (30) follows similarly by slightly modifying the definition of D D D: REFERENCES [1] S. Bellini and F. Rocca, " Asymptoti...

متن کامل

Adaptive Algorithms Versus Higher Order Cumulants for Identification and Equalization of MC-CDMA

In this paper, a comparative study between a blind algorithm, based on higher order cumulants, and adaptive algorithms, i.e. Recursive Least Squares (RLS) and Least Mean Squares (LMS) for MultiCarrier Code Division Multiple Access (MC-CDMA) systems equalization is presented. Two practical frequency-selective fading channels, called Broadband Radio Access Network (BRAN A, BRAN B) normalized for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Signal Processing

دوره 47  شماره 

صفحات  -

تاریخ انتشار 1999